Performance Analysis of Montgomery Multiplication Algorithm for Multi-core Systems Using Concurrent Java
نویسنده
چکیده
The Requirement of information security on topology network has become more important. Cryptography is a method to provide information confidentiality, authenticity and integrity. There are so many challenges to implement a public key cryptography algorithm such as execution time, time consuming, time cost, integrated methods, memory Requirement in public key cryptography. In parallel computation to solve the formal algorithm in parallel by partitioning method can scale over different number of cores given .A parallel computation can be stable perform analysis of public key cryptography using concurrent java core communication such as available time, request time, allowance time . In this paper, public key cryptography algorithm can be implemented a parallel RSA with threads and to improve the performance of the algorithm by execution time. Various public key cryptography algorithms can be implemented using execution time.
منابع مشابه
Montgomery Modular Multiplication Algorithm for Multi-Core Systems
This paper presents an efficient software implementation of the Montgomery modular multiplication algorithm on a multi-core system. A prototype of general multi-core systems is designed with GEZEL. We propose a new instruction scheduling method for multi-core systems that can reduce the number of data transfers between different cores. Compared to the implementations on a single-core system, th...
متن کاملEfficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملHighly-Parallel Montgomery Multiplication for Multi-Core General-Purpose Microprocessors
Popular public key algorithms such as RSA and Di e-Hellman key exchange, and more advanced cryptographic schemes such as Paillier's and Damgård-Jurik's algorithms (with applications in private information retrieval), require e cient modular multiplication with large integers of size at least 1024 bits. Montgomery multiplication algorithm has proven successful for modular multiplication of large...
متن کاملA Comparative Study on Performance Benefits of Multi-core CPUs using OpenMP
Achieving scalable parallelism from general programs was not successful to this point. To extract parallelism from programs has become the key focus of interest on multi-core CPUs. There are many techniques and programming models such as MPI, CUDA and OpenMP adopted in order to exploit more performance. But there is an urge to find the best parallel programming techniques for the benefit of per...
متن کاملThe Parallel FDFM Processor Core Approach for CRT-based RSA Decryption
One of the key points of success in high performance computation using an FPGA is the efficient usage of DSP slices and block RAMs in it. This paper presents a FDFM (Few DSP slices and Few block RAMs) processor core approach for implementing RSA encryption. In our approach, an efficient hardware algorithm for Chinese Remainder Theorem (CRT) based RSA decryption using Montgomery multiplication a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011